0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.14	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.36	% Computer   : n009.cluster.edu
0.14/0.36	% Model      : x86_64 x86_64
0.14/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory     : 8042.1875MB
0.14/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 1200
0.14/0.36	% WCLimit    : 120
0.14/0.36	% DateTime   : Tue Jul 13 14:33:57 EDT 2021
0.14/0.36	% CPUTime    : 
0.14/0.36	% Number of cores: 8
0.14/0.36	% Python version: Python 3.6.8
0.14/0.36	# Version: 2.6rc1-ho
0.22/0.38	# No SInE strategy applied
0.22/0.38	# Trying AutoSched0 for 59 seconds
0.22/0.49	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.22/0.49	# and selection function SelectMaxLComplexAvoidPosPred.
0.22/0.49	#
0.22/0.49	# Preprocessing time       : 0.058 s
0.22/0.49	
0.22/0.49	# Proof found!
0.22/0.49	# SZS status Theorem
0.22/0.49	# SZS output start CNFRefutation
0.22/0.49	thf(fact_131_a__meet__b__eq__d, axiom, ![X6:a, X5:a, X7:a]:((inf @ (modula17988509_aux_a @ inf @ sup @ X6 @ X5 @ X7) @ (modula1373251614_aux_a @ inf @ sup @ X6 @ X5 @ X7))=(modula1936294176_aux_a @ inf @ sup @ X6 @ X5 @ X7)<=less_eq @ (modula1936294176_aux_a @ inf @ sup @ X6 @ X5 @ X7) @ (modula1144073633_aux_a @ inf @ sup @ X6 @ X5 @ X7)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_131_a__meet__b__eq__d)).
0.22/0.49	thf(conj_1, conjecture, (inf @ (modula17988509_aux_a @ inf @ sup @ b @ c @ a2) @ (modula581031071_aux_a @ inf @ sup @ a2 @ b @ c))=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_1)).
0.22/0.49	thf(fact_112_local_Oc__a, axiom, ![X6:a, X5:a, X7:a]:(modula581031071_aux_a @ inf @ sup @ X6 @ X5 @ X7)=(modula17988509_aux_a @ inf @ sup @ X7 @ X6 @ X5), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_112_local_Oc__a)).
0.22/0.49	thf(fact_125_local_Ob__a, axiom, ![X6:a, X5:a, X7:a]:(modula1373251614_aux_a @ inf @ sup @ X6 @ X5 @ X7)=(modula17988509_aux_a @ inf @ sup @ X5 @ X7 @ X6), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_125_local_Ob__a)).
0.22/0.49	thf(fact_87_local_Od__b__c__a, axiom, ![X5:a, X7:a, X6:a]:(modula1936294176_aux_a @ inf @ sup @ X5 @ X7 @ X6)=(modula1936294176_aux_a @ inf @ sup @ X6 @ X5 @ X7), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_87_local_Od__b__c__a)).
0.22/0.49	thf(fact_93_local_Oe__b__c__a, axiom, ![X5:a, X7:a, X6:a]:(modula1144073633_aux_a @ inf @ sup @ X5 @ X7 @ X6)=(modula1144073633_aux_a @ inf @ sup @ X6 @ X5 @ X7), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_93_local_Oe__b__c__a)).
0.22/0.49	thf(conj_0, hypothesis, less_eq @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c) @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
0.22/0.49	thf(c_0_7, plain, ![X6:a, X5:a, X7:a]:(less_eq @ (modula1936294176_aux_a @ inf @ sup @ X6 @ X5 @ X7) @ (modula1144073633_aux_a @ inf @ sup @ X6 @ X5 @ X7)=>(inf @ (modula17988509_aux_a @ inf @ sup @ X6 @ X5 @ X7) @ (modula1373251614_aux_a @ inf @ sup @ X6 @ X5 @ X7))=(modula1936294176_aux_a @ inf @ sup @ X6 @ X5 @ X7)), inference(fof_simplification,[status(thm)],[fact_131_a__meet__b__eq__d])).
0.22/0.49	thf(c_0_8, negated_conjecture, (inf @ (modula17988509_aux_a @ inf @ sup @ b @ c @ a2) @ (modula581031071_aux_a @ inf @ sup @ a2 @ b @ c))!=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])])).
0.22/0.49	thf(c_0_9, plain, ![X1218:a, X1219:a, X1220:a]:(modula581031071_aux_a @ inf @ sup @ X1218 @ X1219 @ X1220)=(modula17988509_aux_a @ inf @ sup @ X1220 @ X1218 @ X1219), inference(variable_rename,[status(thm)],[fact_112_local_Oc__a])).
0.22/0.49	thf(c_0_10, plain, ![X959:a, X960:a, X961:a]:(~less_eq @ (modula1936294176_aux_a @ inf @ sup @ X959 @ X960 @ X961) @ (modula1144073633_aux_a @ inf @ sup @ X959 @ X960 @ X961)|(inf @ (modula17988509_aux_a @ inf @ sup @ X959 @ X960 @ X961) @ (modula1373251614_aux_a @ inf @ sup @ X959 @ X960 @ X961))=(modula1936294176_aux_a @ inf @ sup @ X959 @ X960 @ X961)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])).
0.22/0.49	thf(c_0_11, plain, ![X1082:a, X1083:a, X1084:a]:(modula1373251614_aux_a @ inf @ sup @ X1082 @ X1083 @ X1084)=(modula17988509_aux_a @ inf @ sup @ X1083 @ X1084 @ X1082), inference(variable_rename,[status(thm)],[fact_125_local_Ob__a])).
0.22/0.49	thf(c_0_12, negated_conjecture, (inf @ (modula17988509_aux_a @ inf @ sup @ b @ c @ a2) @ (modula581031071_aux_a @ inf @ sup @ a2 @ b @ c))!=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c), inference(split_conjunct,[status(thm)],[c_0_8])).
0.22/0.49	thf(c_0_13, plain, ![X5:a, X7:a, X6:a]:(modula581031071_aux_a @ inf @ sup @ X5 @ X6 @ X7)=(modula17988509_aux_a @ inf @ sup @ X7 @ X5 @ X6), inference(split_conjunct,[status(thm)],[c_0_9])).
0.22/0.49	thf(c_0_14, plain, ![X5:a, X6:a, X7:a]:((inf @ (modula17988509_aux_a @ inf @ sup @ X5 @ X6 @ X7) @ (modula1373251614_aux_a @ inf @ sup @ X5 @ X6 @ X7))=(modula1936294176_aux_a @ inf @ sup @ X5 @ X6 @ X7)|~less_eq @ (modula1936294176_aux_a @ inf @ sup @ X5 @ X6 @ X7) @ (modula1144073633_aux_a @ inf @ sup @ X5 @ X6 @ X7)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.22/0.49	thf(c_0_15, plain, ![X7:a, X6:a, X5:a]:(modula1373251614_aux_a @ inf @ sup @ X5 @ X6 @ X7)=(modula17988509_aux_a @ inf @ sup @ X6 @ X7 @ X5), inference(split_conjunct,[status(thm)],[c_0_11])).
0.22/0.49	thf(c_0_16, plain, ![X1417:a, X1418:a, X1419:a]:(modula1936294176_aux_a @ inf @ sup @ X1417 @ X1418 @ X1419)=(modula1936294176_aux_a @ inf @ sup @ X1419 @ X1417 @ X1418), inference(variable_rename,[status(thm)],[fact_87_local_Od__b__c__a])).
0.22/0.49	thf(c_0_17, plain, ![X1157:a, X1158:a, X1159:a]:(modula1144073633_aux_a @ inf @ sup @ X1157 @ X1158 @ X1159)=(modula1144073633_aux_a @ inf @ sup @ X1159 @ X1157 @ X1158), inference(variable_rename,[status(thm)],[fact_93_local_Oe__b__c__a])).
0.22/0.49	thf(c_0_18, negated_conjecture, (inf @ (modula17988509_aux_a @ inf @ sup @ b @ c @ a2) @ (modula17988509_aux_a @ inf @ sup @ c @ a2 @ b))!=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c), inference(rw,[status(thm)],[c_0_12, c_0_13])).
0.22/0.49	thf(c_0_19, plain, ![X5:a, X6:a, X7:a]:((inf @ (modula17988509_aux_a @ inf @ sup @ X5 @ X6 @ X7) @ (modula17988509_aux_a @ inf @ sup @ X6 @ X7 @ X5))=(modula1936294176_aux_a @ inf @ sup @ X5 @ X6 @ X7)|~less_eq @ (modula1936294176_aux_a @ inf @ sup @ X5 @ X6 @ X7) @ (modula1144073633_aux_a @ inf @ sup @ X5 @ X6 @ X7)), inference(rw,[status(thm)],[c_0_14, c_0_15])).
0.22/0.49	thf(c_0_20, plain, ![X5:a, X7:a, X6:a]:(modula1936294176_aux_a @ inf @ sup @ X5 @ X6 @ X7)=(modula1936294176_aux_a @ inf @ sup @ X7 @ X5 @ X6), inference(split_conjunct,[status(thm)],[c_0_16])).
0.22/0.49	thf(c_0_21, plain, ![X5:a, X7:a, X6:a]:(modula1144073633_aux_a @ inf @ sup @ X5 @ X6 @ X7)=(modula1144073633_aux_a @ inf @ sup @ X7 @ X5 @ X6), inference(split_conjunct,[status(thm)],[c_0_17])).
0.22/0.49	thf(c_0_22, hypothesis, less_eq @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c) @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c), inference(split_conjunct,[status(thm)],[conj_0])).
0.22/0.49	thf(c_0_23, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_20]), c_0_21]), c_0_22])]), ['proof']).
0.22/0.49	# SZS output end CNFRefutation
0.22/0.49	# Proof object total steps             : 24
0.22/0.49	# Proof object clause steps            : 10
0.22/0.49	# Proof object formula steps           : 14
0.22/0.49	# Proof object conjectures             : 5
0.22/0.49	# Proof object clause conjectures      : 3
0.22/0.49	# Proof object formula conjectures     : 2
0.22/0.49	# Proof object initial clauses used    : 7
0.22/0.49	# Proof object initial formulas used   : 7
0.22/0.49	# Proof object generating inferences   : 1
0.22/0.49	# Proof object simplifying inferences  : 7
0.22/0.49	# Training examples: 0 positive, 0 negative
0.22/0.49	# Parsed axioms                        : 284
0.22/0.49	# Removed by relevancy pruning/SinE    : 0
0.22/0.49	# Initial clauses                      : 398
0.22/0.49	# Removed in clause preprocessing      : 53
0.22/0.49	# Initial clauses in saturation        : 345
0.22/0.49	# Processed clauses                    : 354
0.22/0.49	# ...of these trivial                  : 19
0.22/0.49	# ...subsumed                          : 94
0.22/0.49	# ...remaining for further processing  : 240
0.22/0.49	# Other redundant clauses eliminated   : 100
0.22/0.49	# Clauses deleted for lack of memory   : 0
0.22/0.49	# Backward-subsumed                    : 4
0.22/0.49	# Backward-rewritten                   : 1
0.22/0.49	# Generated clauses                    : 2376
0.22/0.49	# ...of the previous two non-trivial   : 1866
0.22/0.49	# Contextual simplify-reflections      : 0
0.22/0.49	# Paramodulations                      : 2087
0.22/0.49	# Factorizations                       : 2
0.22/0.49	# NegExts                              : 0
0.22/0.49	# Equation resolutions                 : 100
0.22/0.49	# Propositional unsat checks           : 0
0.22/0.49	#    Propositional check models        : 0
0.22/0.49	#    Propositional check unsatisfiable : 0
0.22/0.49	#    Propositional clauses             : 0
0.22/0.49	#    Propositional clauses after purity: 0
0.22/0.49	#    Propositional unsat core size     : 0
0.22/0.49	#    Propositional preprocessing time  : 0.000
0.22/0.49	#    Propositional encoding time       : 0.000
0.22/0.49	#    Propositional solver time         : 0.000
0.22/0.49	#    Success case prop preproc time    : 0.000
0.22/0.49	#    Success case prop encoding time   : 0.000
0.22/0.49	#    Success case prop solver time     : 0.000
0.22/0.49	# Current number of processed clauses  : 214
0.22/0.49	#    Positive orientable unit clauses  : 57
0.22/0.49	#    Positive unorientable unit clauses: 6
0.22/0.49	#    Negative unit clauses             : 1
0.22/0.49	#    Non-unit-clauses                  : 150
0.22/0.49	# Current number of unprocessed clauses: 1857
0.22/0.49	# ...number of literals in the above   : 5028
0.22/0.49	# Current number of archived formulas  : 0
0.22/0.49	# Current number of archived clauses   : 6
0.22/0.49	# Clause-clause subsumption calls (NU) : 8315
0.22/0.49	# Rec. Clause-clause subsumption calls : 4533
0.22/0.49	# Non-unit clause-clause subsumptions  : 90
0.22/0.49	# Unit Clause-clause subsumption calls : 32
0.22/0.49	# Rewrite failures with RHS unbound    : 0
0.22/0.49	# BW rewrite match attempts            : 45
0.22/0.49	# BW rewrite match successes           : 7
0.22/0.49	# Condensation attempts                : 0
0.22/0.49	# Condensation successes               : 0
0.22/0.49	# Termbank termtop insertions          : 59553
0.22/0.49	
0.22/0.49	# -------------------------------------------------
0.22/0.49	# User time                : 0.120 s
0.22/0.49	# System time              : 0.011 s
0.22/0.49	# Total time               : 0.131 s
0.22/0.49	# Maximum resident set size: 2108 pages
0.22/0.49	EOF